package day07;

public class 不同路径一 {
    /*public int uniquePaths(int m, int n) {
        // 初始化
        int[][] dp = new int[m][n];
        // 列
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        // 行
        for (int j = 0; j < n; j++) {
            dp[0][j] = 1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
            }
        }
        return dp[m - 1][n - 1];
    }*/
    public int uniquePaths(int m, int n) {
        // 创建dp
        int[][] dp = new int[m + 1][n + 1];
        dp[0][1] = 1;
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        return dp[m][n];
    }
}
